Space-Filling Curve Based Point Clouds Index

نویسنده

  • Jun Wang
چکیده

Managing large volume points clouds data generated from laser scanner is a challenging problem in Geographic Information System (GIS) and spatial database. Based on analyzing the pros and cons of the existing management methods, this paper presents a method to manage lidar data in databases based on the Hilbert space-filling curve. Each lidar data point (X, Y, and Z) is encoded (indexed) by the 3-D Hilbert curve. Data points are organized together according to their Hilbert codes. The initial encoding level of Hilbert curve is determined by the total number of points and the target record size. The data points are first encoded with this initial level Hilbert curve. After refining and combining processes, the data volume of each group is controlled under the desired size. One record in database represents one data group; the binary blob of the record contains all the data points in one group. Details on constructing 3-D Hilbert curve are discussed. Typical query process “window query” is implemented. Reported in this paper are results based on synthetic and real lidar data collected from ground tripod lidar and airborne lidar equipments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smoothing Space Curves with the MLS Projection

Smoothing space curves has several applications in reverse engineering, CAD modeling and animation. We propose a 3D curve smoothing algorithm with the primary focus on smoothing boundaries of point clouds obtained during reverse engineering laser scanned models. While several point cloud denoising methods exist that handle the normal noise in the data, the boundary curve may still contain tange...

متن کامل

A Closed-Form Algorithm for Converting Hilbert Space-Filling Curve Indices∗

We use the tensor product theory to formulate a closed-form algorithm for converting Hilbert space-filling curve indices of individual points. A twodimensional Hilbert space-filling curve is specified as a permutation which rearranges two-dimensional 2n×2n data elements stored in the row-major order as in C language or the column-major order as in FORTRAN language to the order of traversing a t...

متن کامل

Norm-Based Locality Measures of Two-Dimensional Hilbert Curves

A discrete space-filling curve provides a 1-dimensional indexing or traversal of a multi-dimensional grid space. Applications of space-filling curves include multi-dimensional indexing methods, parallel computing, and image compression. Common goodness-measures for the applicability of space-filling curve families are locality and clustering. Locality reflects proximity preservation that close-...

متن کامل

Adaptive Query Processing in Point-Transformation Schemes

Point-transformation schemes transform multidimensional points to one-dimensional values so that conventional access methods can be used to index multidimensional points, enabling convenient integration of multidimensional query facilities into complex transactional database management systems. However, in high-dimensional data spaces, the computational complexity of the required query transfor...

متن کامل

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005